Design Algorithms for Fast Network Restoration via Diversity Coding

The technique of diversity coding was introduced to provide fast restoration against link failures in communication networks. We have recently devised algorithms to incorporate diversity coding into networks with arbitrary topology, so that restoration is achieved very fast, in an almost hitless manner, while spare capacity requirements are competitive with the alternative state-of-the-art restoration techniques. In addition to two techniques we have recently developed, in this paper we introduce two new techniques. These two techniques provide optimal preprovisioning of aggregate traffic and active provisioning of dynamic traffic, respectively. In both cases, diversity coding results in smaller restoration time, simpler synchronization, and much reduced signaling complexity than the existing techniques in the literature. For pre-provisioning, a Mixed Integer Programming (MIP) formulation is developed. For dynamic provisioning, an algorithm employing Integer Linear Programming (ILP) searches for the best coding group to add the new connection demand in an optimum manner.